Genetic Algorithm for Sensor Scheduling with Adjustable Sensing Range
نویسندگان
چکیده
Abstract— Sensing, processing and communication can consume energy in wireless sensor network. The lifetime of wireless sensor network can be extended by efficient power management. One efficient method to extend the network lifetime is to divide the set of all deployed sensors into non disjoint subsets or sensor covers so that each sensor cover can monitor the entire targets. Adjusting the sensing range of each sensor can avoid the redundantly covered targets by multiple sensors. This process saves the energy of sensors and maximizes the number of sensor covers. By identifying maximum number of sensor covers and then activating these sensor covers in sequence will improve the network lifetime. This paper, proposes Genetic Algorithm (GA) as a better solution to the Sensor Covers with Adjustable Sensing Range (SC-ASR). The simulation results of the various problem instances confirm that GA improved the lifetime of sensor network compared with fixed sensing range. KeywordGenetic Algorithm, Sensor scheduling, Adjustable sensing range
منابع مشابه
Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems
In this paper, we present two distributed algorithms to maximize the lifetime of Wireless Sensor Networks for target coverage when the sensors have the ability to adjust their sensing and communication ranges. These algorithms are based on the enhancement of distributed algorithms for fixed range sensors proposed in the literature. We outline the algorithms for the adjustable range model, prove...
متن کاملEnergy-Efficient Data Gathering Algorithms for Improving Lifetime of WSNs with Heterogeneity and Adjustable Sensing Range
In this paper, the energy-efficient data gathering algorithms for improving lifetime of WSNs with heterogeneity and adjustable sensing range have been reported. Here we have assumed that the sensor nodes and base-station are not mobile. The more over location and initial energy of the sensor nodes is known and number of sensor nodes is randomly distributed over a monitoring region. For the hete...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملFDMG: Fault detection method by using genetic algorithm in clustered wireless sensor networks
Wireless sensor networks (WSNs) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or Sink. Since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...
متن کامل